n = int(input())
for i in range(n):
k = int(input())
A = list(map(int, input().split()))
A.sort()
if k > 1:
s = 0
for j in range(0, k-1):
s+=A[j]
if A[-1] == 0:
print(0)
elif A[-1] > s:
print(A[-1] - s)
elif A[-1] != 0:
print(1)
else:
print(0)#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
long long maxi=0;
long long sum=0;
for(int i=0;i<n;i++){
long long x;
cin>>x;
sum+=x;
maxi=max(x,maxi);
}
sum-=maxi;
if(sum==0&&maxi==0){
cout<<0<<endl;
}
else if(sum>=maxi){
cout<<1<<endl;
}
else cout<<maxi-sum<<endl;
}
return 0;
}1334B - Middle Class | 260C - Balls and Boxes |
1554A - Cherry | 11B - Jumping Jack |
716A - Crazy Computer | 644A - Parliament of Berland |
1657C - Bracket Sequence Deletion | 1657B - XY Sequence |
1009A - Game Shopping | 1657A - Integer Moves |
230B - T-primes | 630A - Again Twenty Five |
1234D - Distinct Characters Queries | 1183A - Nearest Interesting Number |
1009E - Intercity Travelling | 1637B - MEX and Array |
224A - Parallelepiped | 964A - Splits |
1615A - Closing The Gap | 4C - Registration System |
1321A - Contest for Robots | 1451A - Subtract or Divide |
1B - Spreadsheet | 1177A - Digits Sequence (Easy Edition) |
1579A - Casimir's String Solitaire | 287B - Pipeline |
510A - Fox And Snake | 1520B - Ordinary Numbers |
1624A - Plus One on the Subset | 350A - TL |